Algoritmo cuántico de Deutsch y Jozsa en GAMA

A different Deutsch-Jozsa

3 Quantum Guessing via Deutsch - Jozsa

We examine the “Guessing Secrets” problem arising in internet routing, in which the goal is to discover two or more objects from a known finite set. We propose a quantum algorithm using O(1) calls to an O(logN) oracle. This improves upon the best known classical result, which uses O(logN) questions and requires an additional O(logN3) steps to produce the answer. In showing the possibilities of ...

Un algoritmo para detectar la polaridad de opiniones en los dominios de laptops y restaurantes

In this article, we present a study for the detection of polarity over a dataset of opinions of users over Restaurants in the Spanish and English language, as well as, opinions about Laptops in the English language. As a proposed solution, we use Vector Support Machine with cross validation. The best results were presented for the Spanish Restaurant Domain with 74% accuracy.

Algoritmo de emparejamiento de perfiles en Servicios Web Semánticos

This paper describes the main characteristics of an algorithm for matching Semantic Web Services. The algorithm takes advantage of the capacities provided by ontologies that describe services and constitutes an improvement when compared to existing proposals. In addition, the main elements related with the implementation are also described. The system interacts with ontologies of descriptions o...

Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms

A long-standing aim of quantum information research is to understand what gives quantum computers their advantage. This requires separating problems that need genuinely quantum resources from those for which classical resources are enough. Two examples of quantum speed-up are the Deutsch–Jozsa and Simon’s problem, both efficiently solvable on a quantum Turing machine, and both believed to lack ...